Efficient Web Navigator for Multi-Constrained Spatial Keyword Queries
نویسندگان
چکیده
منابع مشابه
Efficient Web Navigator for Multi- Constrained Spatial Keyword Queries
The mobile technology revolutionizes the world of communications opening up new possibilities for applications such as location based web search. It involves retrieving the user point of interest (POI) from the web documents based on the query relative to a particular place or region. Existing Location based Applications on mobiles finds the nearest neighbors from the POI database not from the ...
متن کاملA Efficient Processing of Spatial Group Keyword Queries
With the proliferation of geo-positioning and geo-tagging techniques, spatio-textual objects that possess both a geographical location and a textual description are gaining in prevalence, and spatial keyword queries that exploit both location and textual description are gaining in prominence. However, the queries studied so far generally focus on finding individual objects that each satisfy a q...
متن کاملEfficient Processing of Top-k Spatial Keyword Queries
Given a spatial location and a set of keywords, a top-k spatial keyword query returns the k best spatio-textual objects ranked according to their proximity to the query location and relevance to the query keywords. There are many applications handling huge amounts of geotagged data, such as Twitter and Flickr, that can benefit from this query. Unfortunately, the state-of-the-art approaches requ...
متن کاملInherent-Cost Aware Collective Spatial Keyword Queries
With the proliferation of spatial-textual data such as location-based services and geo-tagged websites, spatial keyword queries become popular in the literature. One example of these queries is the collective spatial keyword query (CoSKQ) which is to find a set of objects in the database such that it covers a given set of query keywords collectively and has the smallest cost. Some existing cost...
متن کاملEfficient Temporal Keyword Queries over Versioned Text
Modern text analytics applications operate on large volumes of temporal text data such as Web archives, newspaper archives, blogs, wikis, and micro-blogs. In these settings, searching and mining needs to use constraints on the time dimension in addition to keyword constraints. A natural approach to address such queries is an inverted index whose entries are enriched with valid-time intervals. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communications Software and Systems
سال: 2015
ISSN: 1846-6079,1845-6421
DOI: 10.24138/jcomss.v11i2.104